Pursuing a Faster Evader Based on an Agent Team with Unstable Speeds
نویسندگان
چکیده
Previous studies of multiagent pursuit-evasion problem usually assume that the pursuers can move at stable speeds. However, in many real cases, the pursuers’ speeds may be unstable. In this paper, we study multiagent pursuit-evasion problem based on pursuers with unstable speeds in a continuous open world. We present a feasible pursuing strategy, and the experimental results show that our strategy can generally lead to higher capture success ratios than previous strategies in the situations where the pursuers’ speeds are unstable.
منابع مشابه
Pursuing an evader through cooperative relaying in multi-agent surveillance networks
We provide a distributed control strategy for each mobile agent in a surveillance network in the plane to cooperatively pursue an evader. The pursuit task is relayed from one agent to another when the evader crosses the boundary of the Voronoi regions divided according to the agents’ positions. The dynamics of the resulted cooperative relay-pursuit network are described by a novel model of impu...
متن کاملTracking an omnidirectional evader with a differential drive robot at a bounded variable distance
In this paper, we address the pursuit-evasion problem of tracking an Omnidirectional Agent (OA) at a bounded variable distance using a Differential Drive Robot (DDR), in an Euclidean plane without obstacles. We assume that both players have bounded speeds, and that the DDR is faster than the evader, but due to its nonholonomic constraints it cannot change its motion direction instantaneously. O...
متن کاملVisibility Induction for Discretized Pursuit-Evasion Games
We study a two-player pursuit-evasion game, in which an agent moving amongst obstacles is to be maintained within “sight” of a pursuing robot. Using a discretization of the environment, our main contribution is to design an efficient algorithm that decides, given initial positions of both pursuer and evader, if the evader can take any moving strategy to go out of sight of the pursuer at any tim...
متن کاملProbabilistic Pursuit-Evasion Games: A One-Step Nash Approach
This paper addresses the control of a team of autonomous agents pursuing a smart evader in a nonaccurately mapped terrain. By describing this problem as a partial information Markov game, we are able to integrate map-learning and pursuit. We propose receding horizon control policies, in which the pursuers and the evader try to respectively maximize and minimize the probability of capture at the...
متن کاملMultiagent Pursuit Evasion, or Playing Kabaddi
We study a version of pursuit evasion where two or more pursuers are required to capture the evader because the evader is able to overpower a single defender. The pursuers must coordinate their moves to fortify their approach against the evader while the evader maneuvers to disable pursuers from their unprotected sides. We model this situation as a game of Kabaddi, a popular South Asian sport w...
متن کامل